TSTP Solution File: CSR143^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR143^1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:34:39 EDT 2024
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of formulae : 30 ( 5 unt; 8 typ; 0 def)
% Number of atoms : 67 ( 0 equ; 0 cnn)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 176 ( 26 ~; 20 |; 7 &; 121 @)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 25 ( 25 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 22 ( 0 ^ 20 !; 2 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_23,type,
husband_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_24,type,
lChris_THFTYPE_i: $i ).
thf(decl_25,type,
lCorina_THFTYPE_i: $i ).
thf(decl_26,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(decl_27,type,
n2009_THFTYPE_i: $i ).
thf(decl_28,type,
wife_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_29,type,
inverse_THFTYPE_IIiioIIiioIoI: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(con,conjecture,
? [X6: $i] : ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( husband_THFTYPE_IiioI @ X6 @ lCorina_THFTYPE_i ) ),
file('/export/starexec/sandbox2/tmp/tmp.GYkW7pLd2e/E---3.1_7402.p',con) ).
thf(ax_003,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i ),
file('/export/starexec/sandbox2/tmp/tmp.GYkW7pLd2e/E---3.1_7402.p',ax_003) ).
thf(ax_002,axiom,
! [X5: $i] : ( holdsDuring_THFTYPE_IiooI @ X5 @ $true ),
file('/export/starexec/sandbox2/tmp/tmp.GYkW7pLd2e/E---3.1_7402.p',ax_002) ).
thf(ax_001,axiom,
! [X1: $i > $i > $o,X2: $i > $i > $o] :
( ( inverse_THFTYPE_IIiioIIiioIoI @ X2 @ X1 )
=> ! [X3: $i,X4: $i] :
( ( X2 @ X3 @ X4 )
<=> ( X1 @ X4 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.GYkW7pLd2e/E---3.1_7402.p',ax_001) ).
thf(ax,axiom,
inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI,
file('/export/starexec/sandbox2/tmp/tmp.GYkW7pLd2e/E---3.1_7402.p',ax) ).
thf(c_0_5,negated_conjecture,
~ ? [X6: $i] :
( ( ~ ( husband_THFTYPE_IiioI @ X6 @ lCorina_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( husband_THFTYPE_IiioI @ X6 @ lCorina_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
thf(c_0_6,axiom,
( ( ~ ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_003]) ).
thf(c_0_7,negated_conjecture,
! [X13: $i] :
( ( ~ ( husband_THFTYPE_IiioI @ X13 @ lCorina_THFTYPE_i )
| ( husband_THFTYPE_IiioI @ X13 @ lCorina_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( husband_THFTYPE_IiioI @ X13 @ lCorina_THFTYPE_i ) )
& ( ~ ( husband_THFTYPE_IiioI @ X13 @ lCorina_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
thf(c_0_8,plain,
! [X14: $i] : ( holdsDuring_THFTYPE_IiooI @ X14 @ $true ),
inference(variable_rename,[status(thm)],[ax_002]) ).
thf(c_0_9,plain,
! [X15: $i > $i > $o,X16: $i > $i > $o,X17: $i,X18: $i] :
( ( ~ ( X16 @ X17 @ X18 )
| ( X15 @ X18 @ X17 )
| ~ ( inverse_THFTYPE_IIiioIIiioIoI @ X16 @ X15 ) )
& ( ~ ( X15 @ X18 @ X17 )
| ( X16 @ X17 @ X18 )
| ~ ( inverse_THFTYPE_IIiioIIiioIoI @ X16 @ X15 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax_001])])])])]) ).
thf(c_0_10,plain,
( ( ~ ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
thf(c_0_11,negated_conjecture,
( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,plain,
! [X3: $i] : ( holdsDuring_THFTYPE_IiooI @ X3 @ $true ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_13,plain,
! [X4: $i,X3: $i,X2: $i > $i > $o,X1: $i > $i > $o] :
( ( X2 @ X4 @ X3 )
| ~ ( X1 @ X3 @ X4 )
| ~ ( inverse_THFTYPE_IIiioIIiioIoI @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_14,plain,
inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI,
inference(split_conjunct,[status(thm)],[ax]) ).
thf(c_0_15,plain,
( ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_16,negated_conjecture,
~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).
thf(c_0_17,negated_conjecture,
! [X3: $i] :
( ~ ( husband_THFTYPE_IiioI @ X3 @ lCorina_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_18,plain,
! [X4: $i,X3: $i] :
( ( husband_THFTYPE_IiioI @ X3 @ X4 )
| ~ ( wife_THFTYPE_IiioI @ X4 @ X3 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_19,plain,
wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i,
inference(sr,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_20,negated_conjecture,
! [X3: $i] :
~ ( husband_THFTYPE_IiioI @ X3 @ lCorina_THFTYPE_i ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_12])]) ).
thf(c_0_21,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : CSR143^1 : TPTP v8.1.2. Released v4.1.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n025.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 14:55:08 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running higher-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.GYkW7pLd2e/E---3.1_7402.p
% 0.16/0.44 # Version: 3.1.0-ho
% 0.16/0.44 # Preprocessing class: HSSSSMSSSSSNSFA.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting new_ho_14 with 1500s (5) cores
% 0.16/0.44 # Starting full_lambda_8 with 300s (1) cores
% 0.16/0.44 # Starting new_ho_13 with 300s (1) cores
% 0.16/0.44 # Starting ho_unfolding_3 with 300s (1) cores
% 0.16/0.44 # new_ho_14 with pid 7482 completed with status 0
% 0.16/0.44 # Result found by new_ho_14
% 0.16/0.44 # Preprocessing class: HSSSSMSSSSSNSFA.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting new_ho_14 with 1500s (5) cores
% 0.16/0.44 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.44 # Search class: HGHNF-FFSF11-SSFFFSBN
% 0.16/0.44 # partial match(1): HGHNF-FFSF11-SSSFFSBN
% 0.16/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting ehoh_best2_full_lfho with 811s (1) cores
% 0.16/0.44 # Starting new_ho_14 with 151s (1) cores
% 0.16/0.44 # Starting sh2l with 136s (1) cores
% 0.16/0.44 # Starting post_as_ho1 with 136s (1) cores
% 0.16/0.44 # Starting ehoh_best3_rw with 136s (1) cores
% 0.16/0.44 # new_ho_14 with pid 7487 completed with status 0
% 0.16/0.44 # Result found by new_ho_14
% 0.16/0.44 # Preprocessing class: HSSSSMSSSSSNSFA.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting new_ho_14 with 1500s (5) cores
% 0.16/0.44 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.44 # Search class: HGHNF-FFSF11-SSFFFSBN
% 0.16/0.44 # partial match(1): HGHNF-FFSF11-SSSFFSBN
% 0.16/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting ehoh_best2_full_lfho with 811s (1) cores
% 0.16/0.44 # Starting new_ho_14 with 151s (1) cores
% 0.16/0.44 # Preprocessing time : 0.001 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Theorem
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 14
% 0.16/0.44 # Removed by relevancy pruning/SinE : 9
% 0.16/0.44 # Initial clauses : 10
% 0.16/0.44 # Removed in clause preprocessing : 1
% 0.16/0.44 # Initial clauses in saturation : 9
% 0.16/0.44 # Processed clauses : 16
% 0.16/0.44 # ...of these trivial : 1
% 0.16/0.44 # ...subsumed : 1
% 0.16/0.44 # ...remaining for further processing : 14
% 0.16/0.44 # Other redundant clauses eliminated : 0
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 0
% 0.16/0.44 # Backward-rewritten : 0
% 0.16/0.44 # Generated clauses : 2
% 0.16/0.44 # ...of the previous two non-redundant : 1
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 0
% 0.16/0.44 # Paramodulations : 2
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 0
% 0.16/0.44 # Disequality decompositions : 0
% 0.16/0.44 # Total rewrite steps : 3
% 0.16/0.44 # ...of those cached : 2
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 7
% 0.16/0.44 # Positive orientable unit clauses : 3
% 0.16/0.44 # Positive unorientable unit clauses: 0
% 0.16/0.44 # Negative unit clauses : 2
% 0.16/0.44 # Non-unit-clauses : 2
% 0.16/0.44 # Current number of unprocessed clauses: 1
% 0.16/0.44 # ...number of literals in the above : 3
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 8
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 2
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 2
% 0.16/0.44 # Non-unit clause-clause subsumptions : 0
% 0.16/0.44 # Unit Clause-clause subsumption calls : 0
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 0
% 0.16/0.44 # BW rewrite match successes : 0
% 0.16/0.44 # Condensation attempts : 0
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 672
% 0.16/0.44 # Search garbage collected termcells : 106
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.002 s
% 0.16/0.44 # System time : 0.003 s
% 0.16/0.44 # Total time : 0.005 s
% 0.16/0.44 # Maximum resident set size: 1852 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.009 s
% 0.16/0.44 # System time : 0.009 s
% 0.16/0.44 # Total time : 0.018 s
% 0.16/0.44 # Maximum resident set size: 1724 pages
% 0.16/0.44 % E---3.1 exiting
% 0.16/0.44 % E exiting
%------------------------------------------------------------------------------